系统工程与电子技术

• 软件、算法与仿真 • 上一篇    下一篇

个性化隐私保护轨迹发布算法

孙岚, 郭旭东, 王一蕾, 吴英杰   

  1. (福州大学数学与计算机科学学院, 福建 福州 350116)
  • 出版日期:2014-12-08 发布日期:2010-01-03

Personalized privacy preserving algorithm for trajectory data publishing

SUN Lan, GUO Xu dong, WANG Yi lei, WU Ying jie   

  1. (College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, China)
  • Online:2014-12-08 Published:2010-01-03

摘要: 传统关于轨迹隐私保护的研究大多假设所有轨迹具有相同的隐私需求。然而,现实应用中不同轨迹的隐私需求可能不尽相同,使用相同的隐私保护标准对轨迹进行处理将使所发布轨迹的可用性降低。为此,提出一种可实现个性化轨迹隐私保护的(K,ε)隐私模型和基于该模型的个性化隐私保护轨迹匿名算法IDU-K。算法在保证发布轨迹数据的信息损失率不超过阈值ε的前提下,采用基于贪心聚类的等价类划分思想对含有不同隐私需求的轨迹集合进行个性化匿名处理。实验对算法IDU-K的隐私保护有效性及发布数据可用性与同类算法进行比较分析。实验结果表明,算法IDU-K是有效可行的。

Abstract: Most exist works on privacy preserving trajectory data publishing adopt the same privacy preserving standards for all trajectories, without regard to their possibly different privacy requirements. The consequence is that the data utility of released trajectory data may be greatly reduced. In order to address this issue, a(K,ε)privacy model and an algorithm IDU-K for personalized privacy preserving trajectory data publishing are presented. The key idea of IDUK is to anonymize the trajectories personally by equivalence partitioning based on greedy clustering while assuring the information loss ratio of the released trajectory data not more han a threshold ε. Experimental analysis is designed by comparing IDU-K and the traditional algorithm on the effectiveness and data utility. Experimental results show that IDU-K is effective and feasible.